Cyclic scheduling of a 2-machine robotic cell with tooling constraints
نویسندگان
چکیده
منابع مشابه
Cyclic scheduling of a 2-machine robotic cell with tooling constraints
In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required operations as long as the required tools are stored in their tool magazines. However, this assumption may be unrealistic at times since the tool magazines have limited capacity and in many practical instances the required...
متن کاملScheduling identical parallel machines with tooling constraints
We model and solve the problem of sequencing a set of jobs with specified processing times and tool requirements on a set of identical parallel machines. Decisions concern the assignment of jobs to machines, their sequencing, and the allocation of tools on each machine. The objective function minimizes the makespan. We propose an adaptive large neighborhood search metaheuristic in which the des...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملCyclic scheduling in 3-machine robotic ow shops
We consider a robotic ow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a xed sequence of activities. This sequence of activities is called a 1-unit cycle if each execution of the sequence results in the production o...
متن کاملA Polynomial Algorithm for 2-Cyclic Robotic Scheduling
In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-called 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. The earlier known polynomia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2006
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.03.021